Anti-unification for Unranked Terms and Hedges
نویسندگان
چکیده
منابع مشابه
Anti-Unification for Unranked Terms and Hedges
We study anti-unification for unranked terms and hedges that may contain term and hedge variables. The anti-unification problem of two hedges s1 and s2 is concerned with finding their generalization, a hedge q such that both s1 and s2 are instances of q under some substitutions. Hedge variables help to fill in gaps in generalizations, while term variables abstract single (sub)terms with differe...
متن کاملAnti-Unification with Unranked Terms and Hedges
We study anti-unification for unranked terms and hedges that may contain term and hedge variables. The anti-unification problem of two hedges s̃1 and s̃2 is concerned with finding their generalization, a hedge q̃ such that both s̃1 and s̃2 are instances of q̃ under some substitutions. Hedge variables help to fill in gaps in generalizations, while term variables abstract single (sub)terms with differe...
متن کاملUnranked Second-Order Anti-Unification
In this work we study anti-unification for unranked terms and hedges, permitting context and hedge variables. Hedges are sequences of unranked terms. The anti-unification problem of two hedges s̃ and q̃ is concerned with finding their generalization, a hedge g̃ such that both s̃ and q̃ are substitution instances of g̃. Second-order power is gained by using context variables to generalize vertical dif...
متن کاملUnranked Anti-Unification with Hedge and Context Variables
In this work we study anti-unification for unranked terms and hedges, permitting context and hedge variables. Hedges are sequences of unranked terms. The anti-unification problem of two hedges s̃ and q̃ is concerned with finding their generalization, a hedge g̃ such that both s̃ and q̃ are instances of g̃ under some substitutions. Context variables are used to abstract vertical differences in the inp...
متن کاملUnification on Compressed Terms
First-order term unification is an essential concept in areas like functional and logic programming, automated deduction, deductive databases, artificial intelligence, information retrieval, compiler design, etc. We build upon recent developments in grammar-based compression mechanisms for terms and investigate algorithms for first-order unification and matching on compressed terms. We prove th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2013
ISSN: 0168-7433,1573-0670
DOI: 10.1007/s10817-013-9285-6